Singular Combinatorics ∗
نویسنده
چکیده
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. “Singularity analysis” reviewed here provides constructive estimates that are applicable in several areas of combinatorics. It constitutes a complex-analytic Tauberian procedure by which combinatorial constructions and asymptotic–probabilistic laws can be systematically related. 2000 Mathematics Subject Classification: 05A15, 05A16, 30B10, 39B05, 60C05, 60F05, 68Q25.
منابع مشابه
Multilinear Singular Operators with Fractional Rank
We prove bounds for multilinear operators on R given by multipliers which are singular along a k dimensional subspace. The new case of interest is when the rank k/d is not an integer. Connections with the concept of true complexity from Additive Combinatorics are also investigated.
متن کاملThe non-singularity of looped trees and complement of trees with diameter 5
A graph G is said to be singular if its adjacency matrix is singular; otherwise it is said to be non-singular. In this paper, we introduce a class of graphs called looped-trees, and find the determinant and the nonsingularity of looped-trees. Moreover, we determine the singularity or non-singularity of the complement of a certain class of trees with diameter 5 by using the results for looped-tr...
متن کاملSome Additive Combinatorics Problems in Matrix Rings
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers. 2000 Mathematics Subject Classification. 11C20, 11D79, 11T23
متن کاملANALYTIC COMBINATORICS OF CHORD AND HYPERCHORD DIAGRAMS WITH k CROSSINGS
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function of the configurations with exactly k crossings as a rational function of the generating function of crossing-free configurations. Using these expressions, we...
متن کاملA New Löwenheim-skolem Theorem
This paper establishes a refinement of the classical LöwenheimSkolem theorem. The main result shows that any first order structure has a countable elementary substructure with strong second order properties. Several consequences for Singular Cardinals Combinatorics are deduced from this.
متن کامل